Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملalgorithms for biobjective shortest path problems in fuzzy networks
we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملcient Algorithms for the Minimum Shortest Path
Given an undirected graph G = (V;E) with positive edge weights (lengths) w : E ! < + , a set of terminals (sinks) N V , and a unique root node r 2 N , a shortest-path Steiner arborescence (simply called an arborescence in the following) is a Steiner tree rooted at r spanning all terminals in N such that every sourceto-sink path is a shortest path in G. Given a triple (G;N; r), the MinimumShorte...
متن کاملFast shortest path computation in time-dependent traffic networks
In agent based traffic simulations which use systematic relaxation to reach a steady state of the scenario, the performance of the routing algorithm used for finding a path from a start node to an end node in the network is crucial for the overall performance. For example, a systematic relaxation process for a large scale scenario with about 7.5 million inhabitants (roughly the population of Sw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1990
ISSN: 0004-5411,1557-735X
DOI: 10.1145/79147.214078